Algebraic Geometric Techniques for Depth-4 PIT & Sylvester-Gallai Conjectures for Varieties
نویسنده
چکیده
We present an algebraic-geometric approach for devising a deterministic polynomial time blackbox identity testing (PIT) algorithm for depth-4 circuits with bounded top fanin. Using our approach, we devise such an algorithm for the case when such circuits have bounded bottom fanin and satisfy a certain non-degeneracy condition. In particular, we present an algorithm that, given blackboxes to P1 · · ·Pd, Q11 · · ·Q1d1 , . . . , Qk1 · · ·Qkdk where k and the degrees of Pi’s and Qij’s are bounded, determines the membership of P1 · · ·Pd in the radical of the ideal generated by Q11 · · ·Q1d1 , . . . , Qk1 · · ·Qkdk in deterministic poly(n, d,maxi(di))-time. We also give a Dvir-Shpilka [DS06]-like approach to resolve the degenerate case and, in the process, initiate a new direction in incidence geometry for non-linear varieties. This approach consists of a series of Sylvester-Gallai type conjectures for boundeddegree varieties and, if true, imply a complete derandomization in the bounded bottom fanin case. To the best of our knowledge, these problems have not been posed before. ∗Research supported by MSR India PhD Fellowship.
منابع مشابه
A From Sylvester-Gallai Configurations to Rank Bounds: Improved Blackbox Identity Test for Depth-3 Circuits
We study the problem of identity testing for depth-3 circuits of top fanin k and degree d. We give a new structure theorem for such identities that improves the known deterministic d O(k) -time blackbox identity test over rationals (Kayal & Saraf, FOCS 2009) to one that takes dO(k 2)-time. Our structure theorem essentially says that the number of independent variables in a real depth-3 identity...
متن کاملIdentity Testing for Depth-3 Circuits with Small Fan-in
4 History of the Sylvester-Gallai Problem 6 4.1 Melchior’s Inequality . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 4.2 Motzkin’s Inequality . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.3 Kelly and Moser . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.4 Green and Tao . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 4.5 How to describe 3-color ...
متن کاملImproved rank bounds for design matrices and a new proof of Kelly's theorem
We study the rank of complex sparse matrices in which the supports of different columns have small intersections. The rank of these matrices, called design matrices, was the focus of a recent work by Barak et. al. [BDWY11] in which they were used to answer questions regarding point configurations. In this work we derive near-optimal rank bounds for these matrices and use them to obtain asymptot...
متن کاملModuli Theory and Arithmetic of Algebraic Varieties
This paper surveys a few applications of algebro-geometric moduli theory to issues concerning the distribution of rational points in algebraic varieties. A few well known arithmetic problems with their expected answers (the socalled “diophantine conjectures”) are introduced in section 2, explaining their connection with a circle of ideas, whose goal is to find a unifying theme in analytic, diff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 21 شماره
صفحات -
تاریخ انتشار 2014